Maximizing Submodular+Supermodular Functions Subject to a Fairness Constraint

We investigate the problem of maximizing sum submodular and supermodular functions under a fairness constraint. This function is non-submodular in general. For an offline model, we introduce two approximation algorithms: A greedy algorithm threshold algorithm. streaming propose one-pass also analyze ratios these algorithms, which all depend on total curvature function. The computable polynomial time widely utilized literature.